Low-complexity polar code construction for higher order modulation
نویسندگان
چکیده
منابع مشابه
Low Complexity Belief Propagation Polar Code Decoders
Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compa...
متن کاملPolar Code Construction for List Decoding
A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the ”low weight bits” (LWB) is presented. Simulation results show that the LWB-polar ...
متن کاملHigher-Order Code Splicing
Run-time code generation (RTCG) and just-in-time compilation (JIT) are features of modern programming systems to strike the balance between generality and eeciency. Since RTCG and JIT techniques are not portable and notoriously hard to implement, we propose code splicing as an alternative for dynamically-typed higher-order programming languages. Code splicing combines precompiled pieces of code...
متن کاملA Low-Complexity Transmit Cooperation Scheme based on Layered Higher Order Modulation
Decode-and-Forward (DF) is a popular approach to transmit information over a cooperative relay channel. However, DF is not optimised for any propagation conditions since it simply combines the received information coming from different sources regardless of their respective link qualities. In this paper, we propose a novel transmit cooperation scheme that can take advantage of asymmetric link q...
متن کاملUpgraded Approximation of Non-Binary Alphabets for Polar Code Construction
An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet size. It is shown that this algorithm can be used to reduce the output alphabet size to the input alphabet size in most cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9661-2